P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
21	February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-04 17:20:26 Computational complexity theory Complexity classes Theory of computation Polynomial hierarchy P versus NP problem IP True quantified Boolean formula NP PP Oracle machine PSPACE-complete Polynomial-time reduction
22	Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions Add to Reading List Source URL: cognitiveharmony.net Language: English - Date: 2008-09-30 17:00:23 Complexity classes NP-hard NP-complete NP P versus NP problem P Reduction Decision problem Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
23	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
24	The Astrophysical Journal, 567:L97–L101, 2002 March 1 䉷 2002. The American Astronomical Society. All rights reserved. Printed in U.S.A. PROMINENCE MAGNETIC DIPS IN THREE-DIMENSIONAL SHEARED ARCADES G. Aulanier Observ Add to Reading List Source URL: www.lesia.obspm.fr Language: English - Date: 2009-05-27 05:36:12 Electromagnetism Sun Magnetostatics Corona Magnetic reconnection P versus NP problem Magnetism Solar prominence Solar flare Physics Plasma physics Space plasmas
25	Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2006-11-19 23:12:18 Complexity classes Circuit complexity Computability theory Mathematical optimization FO NP-complete P versus NP problem Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
26	Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1 Add to Reading List Source URL: www.asiapacific-mathnews.com Language: English - Date: 2014-02-27 03:55:07 Complexity classes NP-complete problems Mathematical optimization NP-complete Computational problems P versus NP problem NP Decision problem Clique problem Theoretical computer science Computational complexity theory Applied mathematics
27	Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT Add to Reading List Source URL: web.mit.edu Language: English - Date: 2013-06-23 10:21:36 Dynamical systems Stability theory Lyapunov function Lyapunov stability Quadratic Polynomial P versus NP problem Time complexity Lyapunov theory Theoretical computer science Mathematics Computational complexity theory
28	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics
29	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
30	−Summary of the Interim Report− Nonylphenol AugustNational Institute of Technology and Evaluation Add to Reading List Source URL: www.nite.go.jp Language: English - Date: 2015-04-24 00:49:29 Phenols Chemistry Knowledge Surfactant P versus NP problem Sludge Mysteries Endocrine disruptors Nonylphenol

UPDATE